Some Lemmas to Hopefully Enable Search Methods to Find Short and Human Readable Proofs for Incidence Theorems of Projective Geometry

نویسنده

  • Dominique Michelucci
چکیده

Search methods provide short and human readable proofs, i.e. with few algebra, of most of the theorems of the Euclidean plane. They are less succesful and convincing for incidence theorems of projective geometry, which has received less attention up to now. This is due to the fact that basic notions, like angles and distances, which are relevant for Euclidean geometry, are no more relevant for projective geometry. This article suggests that search methods can also provide short and human readable proofs of incidence theorems of projective geometry with well chosen notions, rules or lemmas. This article proposes such lemmas, and show that they indeed permit to find by hand short proofs of some theorems of projective geometry.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automated Generation of Readable Proofs with Geometric Invariants† I. Multiple and Shortest Proof Generation

In this series of papers, we discuss how to use a fixed set of high level geometry lemmas or rules related to geometric invariants, such as area, full-angle, etc., to produce short and human-readable proofs in geometry, especially to produce multiple and shortest proofs of a given geometry theorem. These rules are proved to be much more effective and concise than the rules based on triangle con...

متن کامل

A case study in formalizing projective geometry in Coq: Desargues theorem

Formalizing geometry theorems in a proof assistant like Coq is challenging. As emphasized in the literature, the non-degeneracy conditions lead to long technical proofs. In addition, when considering higher-dimensions, the amount of incidence relations (e.g. point-line, point-plane, line-plane) induce numerous technical lemmas. In this article, we investigate formalizing projective plane geomet...

متن کامل

A Decision Procedure for Geometry in Coq

We present in this paper the development of a decision procedure for affine plane geometry in the Coq proof assistant. Among the existing decision methods, we have chosen to implement one based on the area method developed by Chou, Gao and Zhang, which provides short and “readable” proofs for geometry theorems. The idea of the method is to express the goal to be proved using three geometric qua...

متن کامل

Automated Theorem Proving in Projective Geometry with Bracket Algebra

We present a method which can produce readable proofs for theorems of constructive type involving points, lines and conics in projective geometry. The method extends Wu’s method to bracket algebra and develops the area method of Chou, Gao and Zhang in the framework of projective geometry.

متن کامل

The full angle method on the OpenGeoProver

Geometry with its formal, logical and spatial properties is well suited to be taught in an environment that includes dynamic geometry software (DGSs), geometry automated theorem provers (GATPs) and repositories of geometric problems (RGPs). With the integration of those tools in a given learning environment the student is able to explore the built-in knowledge, but also to do new constructions,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010